818A - Diplomas and Certificates - CodeForces Solution

implementation math *800

Please click on ads to support us..

Python Code: 

n,k =map(int,input().split())
x=(n//2)//(1+k)
print(x,x*k,n-(x*(k+1)))

C++ Code: 

#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

int main()
{
    ll n , k;
    cin>>n>>k;
    double d = floor((double)n / (2*(k+1.0))) , c = k * d;
    cout<<(ll)d<<" "<<(ll) ceil(c)<<" "<<n - (ll)(c+d)<<endl;
    return 0;
}


Comments

Submit
0 Comments
More Questions

1662A - Organizing SWERC
466C - Number of Ways
1146A - Love "A"
1618D - Array and Operations
1255A - Changing Volume
1710C - XOR Triangle
415C - Mashmokh and Numbers
8A - Train and Peter
591A - Wizards' Duel
1703G - Good Key Bad Key
1705A - Mark the Photographer
1707A - Doremy's IQ
1706B - Making Towers
1325B - CopyCopyCopyCopyCopy
1649C - Weird Sum
1324B - Yet Another Palindrome Problem
525A - Vitaliy and Pie
879A - Borya's Diagnosis
1672B - I love AAAB
1673A - Subtle Substring Subtraction
1345A - Puzzle Pieces
711A - Bus to Udayland
779B - Weird Rounding
1703D - Double Strings
1704C - Virus
63A - Sinking Ship
1704B - Luke is a Foodie
298B - Sail
239A - Two Bags of Potatoes
1704E - Count Seconds